Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
771	Laboratoire de l’Informatique du Parall´elisme ´ Ecole Add to Reading List Source URL: www.ens-lyon.fr Language: English - Date: 2006-03-14 02:22:56 Graph coloring Register allocation NP-complete problems Static single assignment form NP-complete Compiler optimization Chordal graph Gregory Chaitin Graph Graph theory Theoretical computer science Mathematics
772	Author manuscript, published in "12th International Conference on Embedded Computer Systems: Architecture, Modeling and Simulation (SAMOS XII), Agios Konstantinos : Greece (2012)" Add to Reading List Source URL: hal.archives-ouvertes.fr Language: English - Date: 2012-07-27 05:20:18 Clique Graph Directed acyclic graph Neighbourhood Graph operations Path decomposition Edge coloring Graph theory NP-complete problems Graph coloring
773	Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal Daniel Lokshtanov∗ Add to Reading List Source URL: www.siam.org Language: English - Date: 2011-01-10 07:51:45 NP-complete problems Graph coloring Graph operations Path decomposition Tree decomposition Connectivity Graph List coloring Independent set Graph theory Theoretical computer science Mathematics
774	Hypergraph Partitioning and Clustering David A. Papa and Igor L. Markov University of Michigan, EECS Department, Ann Arbor, MI[removed] Add to Reading List Source URL: www.podload.org Language: English - Date: 2008-09-18 03:11:42 Hypergraph NP-complete problems Graph partition Graph Vertex Constraint programming Fiduccia-Mattheyses algorithm Erdős–Faber–Lovász conjecture Graph theory Mathematics Theoretical computer science
775	Choosability of P5-free graphs∗ Petr A. Golovach† Add to Reading List Source URL: www.ii.uib.no Language: English - Date: 2009-05-31 05:49:27 Graph operations List coloring Dominating set Cograph Graph Bipartite graph Degeneracy Graph homomorphism Graph theory Graph coloring NP-complete problems
776	An Experimental Study of Minimum Mean Cycle Algorithms Loukas Georgiadis1 Add to Reading List Source URL: www.siam.org Language: English - Date: 2010-03-18 09:58:54 NP-complete problems Routing algorithms Connectivity Spanning tree Graph Hamiltonian path Bellman–Ford algorithm Shortest path problem Cycle graph Graph theory Mathematics Theoretical computer science
777	An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem Arash Asadpour∗ Add to Reading List Source URL: www.siam.org Language: English - Date: 2009-12-02 12:21:54 Spanning tree Minimum spanning tree Loop-erased random walk Chernoff bound Eulerian path NP-complete problems Dominating set Holomorphic functional calculus Graph theory Mathematics Theoretical computer science
778	doi:[removed]j.cosrev[removed] Add to Reading List Source URL: geza.kzoo.edu Language: English - Date: 2010-09-27 09:57:50 NP-complete problems Clique Neighbourhood Line graph Adjacency matrix Graph Tree Independent set Planar separator theorem Graph theory Mathematics Theoretical computer science
779	Discrete Mathematics[removed]–12 www.elsevier.com/locate/disc Add to Reading List Source URL: www.math.wvu.edu Language: English - Date: 2002-03-12 13:03:16 Minor Arboricity Planar graph Petersen graph Line graph Hamiltonian path Neighbourhood Clique Graph homomorphism Graph theory NP-complete problems Graph coloring
780	Discrete Applied Mathematics[removed] – 158 www.elsevier.com/locate/dam Add to Reading List Source URL: www.mit.edu Language: English - Date: 2007-01-24 18:30:31 NP-complete problems Hamiltonian path Line graph Hamiltonian completion Graph Travelling salesman problem Petersen graph Hamiltonian path problem Graph theory Theoretical computer science Mathematics

UPDATE